On super vertex-graceful unicyclic graphs
نویسندگان
چکیده
منابع مشابه
Super Vertex Graceful Graphs
For a defined graph labeling, there exists a number of bijective functions for a graph of defined order and size which leads to different graphs. In this paper, a mathematical tool is developed to find the number of super vertex graceful graphs for a defined order “p” and size “q”. Mathematics Subject Classification: 05C78
متن کاملOn the vertex separation of unicyclic graphs
In the article “Computing the vertex separation of unicyclic graphs”, Information and Computation 192, pp. 123–161, 2004, Ellis et al. proposed an O(n log n) algorithm for computing both the vertex separation and an optimal layout of a unicyclic graph with n vertices. Using the data structures label and label array, we improve the time complexity of their algorithm to O(n).
متن کاملComputing the vertex separation of unicyclic graphs
We describe an O(n log n) algorithm for the computation of the vertex separation of unicyclic graphs. The algorithm also computes a linear layout with optimal vertex separation in the same time bound. Pathwidth, node search number and vertex separation are different ways of defining the same notion. Path decompositions and search strategies can be derived from linear layouts. The algorithm appl...
متن کاملOn arbitraly vertex decomposable unicyclic graphs with dominating cycle
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that ∑k i=1 ni = n, there exists a partition (V1, . . . , Vk) of vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on ni vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We al...
متن کاملNote on E-super vertex magic graphs
Let G = (V (G), E(G)) be a finite simple graph with p = |V (G)| vertices and q = |E(G)| edges,without isolated vertices or isolated edges. A vertexmagic total labeling is a bijection from V (G) ∪ E(G) to the consecutive integers 1, 2, . . . , p + q, with the property that, for every vertex u in V (G), one has f (u) + uv∈E(G) f (uv) = k for some constant k. Such a labeling is called E-super ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2009
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-009-0001-y